Optimization problem - PDFSEARCH.IO - Document Search Engine

Optimization problem
Results: 1483

#	Item
671	Homework Nine, for Fri[removed]CSE[removed]Problem 6.1. For this problem, use the following subproblem definition: for each 1 ≤ j ≤ n, S(j) = maximum sum of any contiguous subsequence ending exactly at position j. Add to Reading List Source URL: cseweb.ucsd.edu Language: English - Date: 2014-12-06 13:32:37 Mathematics Dynamic programming Equations Operations research Systems engineering Mathematical optimization Control theory Systems theory
672	Computational Complexity Oded Goldreich Department of Computer Science Weizmann Institute of Science Rehovot, Israel. [removed] Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2014-06-22 06:25:18 Complexity classes Structural complexity theory Mathematical optimization Probabilistic complexity theory NP P versus NP problem P Bounded-error probabilistic polynomial Interactive proof system Theoretical computer science Computational complexity theory Applied mathematics
673	A Parallel Tabu Search Alglorithm for the Quadratic Assignment Problem Samuel Gabrielsson September 2007 2 Add to Reading List Source URL: www.ludd.ltu.se Language: English - Date: 2014-05-28 16:52:31 Graph Topology Computational complexity theory Edge coloring Ant colony optimization algorithms Graph theory Mathematics Search algorithm
674	Col Space Newsletter of the AUMS Add to Reading List Source URL: www.aums.org.au Language: English - Date: 2013-10-07 19:17:56 Complexity classes Markov processes Markov models Mathematical optimization Structural complexity theory NP-complete Markov chain NP P versus NP problem Theoretical computer science Computational complexity theory Applied mathematics
675	Friendship and Stable Matching∗ Elliot Anshelevich† Onkar Bhardwaj‡ Martin Hoefer§ Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2013-06-10 10:44:44 Game theory Cooperative games Combinatorics Combinatorial optimization Stable marriage problem Stable roommates problem Price of anarchy Flow network Graph theory Mathematics Matching
676	CS 157: Assignment 5 Douglas R. Lanman 24 April 2006 Problem 2: Printing Neatly In a word processor or in LATEX, one routinely encounters the “pretty printing” problem. That is, Add to Reading List Source URL: mesh.brown.edu Language: English - Date: 2006-04-22 22:51:58 Dynamic programming Equations Mathematical optimization Optimal control Systems engineering Algorithm Logarithm Mathematics Operations research Applied mathematics
677	E MPIRICAL A NALYSIS OF L OCAL S EARCH A LGORITHMS AND P ROBLEM D IFFICULTY IN S ATISFIABILITY by Dave Tae Shik Yoon Add to Reading List Source URL: tidel.mie.utoronto.ca Language: English - Date: 2006-09-14 13:48:35 Mathematics Applied mathematics Operations research Boolean algebra WalkSAT Boolean satisfiability problem Local search Mathematical optimization Satisfiability Theoretical computer science Constraint programming Logic in computer science
678	Leiden, November 18, 2014 OPEN PROBLEM Tuning the Learning Rate: Contradictory Results Add to Reading List Source URL: www.lorentzcenter.nl Language: English - Date: 2014-11-21 09:00:43 Mathematical optimization Mathematics Analysis Mathematical finance Convex function Convex optimization Convex set Convexity Convex analysis Mathematical analysis Convex geometry
679	JOpt TourPlanner product overview Januar 2009 JOpt Tour Planner Add to Reading List Source URL: www.dna-evolutions.com Language: English - Date: 2008-12-26 17:47:25 Operations research Mathematics Network performance Vehicle routing problem Routing Travelling salesman problem Mathematical optimization Genetic algorithm Infrastructure optimization Theoretical computer science NP-complete problems Applied mathematics
680	Introduction to Complexity Theory { Lecture Notes Oded Goldreich Department of Computer Science and Applied Mathematics Weizmann Institute of Science, Israel. Email: [removed] July 31, 1999 Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2000-12-12 06:50:00 Complexity classes Mathematical optimization Structural complexity theory NP-complete Polynomial-time reduction P versus NP problem NP P-complete Probabilistically checkable proof Theoretical computer science Computational complexity theory Applied mathematics

UPDATE